Proving highly-concurrent traversals correct
نویسندگان
چکیده
منابع مشابه
Optimal concurrent tree traversals
We present global and local algorithms for generating traversals of arbitrary trees with the property that the maximum number of edges between successive nodes in any traversal is three, and that this is the best possible result. We describe the application of such traversals to parallel computing.
متن کاملProving Security Protocols Correct
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified in detail, we cannot be certain what constitutes a flaw. Thanks to recent work by a number of researchers, security protocols can now be analyzed formally. The paper outlines the problem area, emphasizing the notion of...
متن کاملProving Hybrid Protocols Correct
R. Boulton & P. Jackson, eds., 14 International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2001), LNAI 2152, pp. 105–120, c ©Springer Verlag, 2001. Abstract. We describe a generic switching protocol for the construction of hybrid protocols and prove it correct with the Nuprl proof development system. For this purpose we introduce the concept of metaproperties and use them to f...
متن کاملProving Concurrent Noninterference
We perform a formal analysis of compositionality techniques for proving possibilistic noninterference for a while language with parallel composition. We develop a uniform framework where we express a wide range of noninterference variants from the literature and compare them w.r.t. their contracts: the strength of the security properties they ensure weighed against the harshness of the syntacti...
متن کاملManaging Change When Proving Software Correct
We propose a new and systematic framework for proof reuse in the context of deductive software verification. The framework generalizes abstract contracts into incremental proof repositories. Abstract contracts enable a separation of concerns between called methods and their implementations, facilitating proof reuse. Proof repositories allow the systematic caching of partial proofs that can be a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2020
ISSN: 2475-1421
DOI: 10.1145/3428196